14 research outputs found
Fullerene graphs have exponentially many perfect matchings
A fullerene graph is a planar cubic 3-connected graph with only pentagonal
and hexagonal faces. We show that fullerene graphs have exponentially many
perfect matchings.Comment: 7 pages, 3 figure
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A 3-path vertex cover in a graph is a vertex subset such that every path
of three vertices contains at least one vertex from . The parameterized
3-path vertex cover problem asks whether a graph has a 3-path vertex cover of
size at most . In this paper, we give a kernel of vertices and an
-time and polynomial-space algorithm for this problem, both new
results improve previous known bounds.Comment: in TAMC 2016, LNCS 9796, 201
The Generation of Fullerenes
We describe an efficient new algorithm for the generation of fullerenes. Our
implementation of this algorithm is more than 3.5 times faster than the
previously fastest generator for fullerenes -- fullgen -- and the first program
since fullgen to be useful for more than 100 vertices. We also note a
programming error in fullgen that caused problems for 136 or more vertices. We
tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We
also check up to 316 vertices a conjecture of Barnette that cubic planar graphs
with maximum face size 6 are hamiltonian and verify that the smallest
counterexample to the spiral conjecture has 380 vertices.Comment: 21 pages; added a not
Local approximation of the Maximum Cut in regular graphs
18 pages, 5 figuresInternational audienceThis paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least in average. When the graph is -regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running in a single round. Here, we investigate the round complexity of deterministic distributed algorithms for MAXCUT in regular graphs. We first prove that if is -regular, with even and fixed, no deterministic algorithm running in a constant number of rounds can achieve a constant approximation ratio. We then give a simple one-round deterministic algorithm achieving an approximation ratio of for -regular graphs with odd. We show that this is best possible in several ways, and in particular no deterministic algorithm with approximation ratio (with ) can run in a constant number of rounds. We also prove results of a similar flavour for the MAXDICUT problem in regular oriented graphs, where we want to maximize the number of arcs oriented from the left part to the right part of the cut